Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory consumption. Therefore, partitioning the ontology was proposed. In this paper, a new clustering method for the concepts within ontologies is proposed, which is called SeeCC. The proposed method is a seeding-based clustering method which reduces the complexity of comparison by using clusters’ seed. The SeeCC method facilitates the memory consuming problem and increases their accuracy in the large-scale matching problem as well. According to the evaluation of SeeCC's results with Falcon-AO and the proposed system by Algergawy accuracy of the ontology matching is easily observed. Furthermore, compared to OAEI (Ontology Alignment Evaluation Initiative), SeeCC has acceptable result with the top ten systems.

Due to the spread of the Internet and its pervasiveness, ``big data" is created daily. Processing this amount of data requires a system with high processing power. In fact, the production and collection of data from a wide range of different equipment and tools lead to the creation of large-scale databases. In dealing with large and unstructured databases and their management, there are always challenges. This study aims to present a model to increase the clustering accuracy of big data using a fuzzy clustering system based on data mining in a MatLab programming environment. For this purpose, first, the importance of each variable in the decision tree models in SPSSModeler software is determined, then with the help of these results, fuzzy rules are explained and a fuzzy inference system is formed in MATLAB software. This study uses data mining techniques such as C\&R Tree, Chaid and C5.0 to study the development of the FCM method to increase clustering accuracy in high volume data and related factors such as data preparation indicators, data type Data quality, data dimensions, data volume and number of clusters were evaluated as inputs and clustering accuracy index was evaluated as output. Then, with the help of these results, the rules of forming a fuzzy inference system were determined and by explaining the membership functions of the decision model, it showed what effect each input index has on the output index.

Background: The recent progress and achievements in the advanced, accurate, and rigorously evaluated algorithms has revolutionized different aspects of the predictive microbiology including bacterial growth.Objectives: In this study, attempts were made to develop a more accurate hybrid algorithm for predicting the bacterial growth curve which can also be applicable in predictive microbiology studies.Materials and Methods: Sigmoid functions, including Logistic and Gompertz, as well as least square support vector machine (LSSVM) based algorithms were employed to model the bacterial growth of the two important strains comprising Listeria monocytogenes and Escherichia coli. Even though cross-validation is generally used for tuning the parameters in LSSVM, in this study, parameters tuning (i.e.,‘c’ and ‘σ’) of the LSSVM were optimized using non-dominated sorting genetic algorithm-II (NSGA-II), named as NSGA-II-LSSVM. Then, the results of each approach were compared with the mean absolute error (MAE) as well as the mean absolute percentage error (MAPE).Results: Applying LSSVM, it was resulted in a precise bacterial growth modeling compared to the sigmoid functions. Moreover, our results have indicated that NSGA-II-LSSVM was more accurate in terms of prediction than LSSVM method.Conclusion: Application of the NSGA-II-LSSVM hybrid algorithm to predict precise values of ‘c’ and ‘σ’ parameters in the bacterial growth modeling resulted in a better growth prediction. In fact, the power of NSGA-II for estimating optimal coefficients led to a better disclosure of the predictive potential of the LSSVM.

We can say a software project is successful when it is delivered on time, within the budget and maintaining the required quality. However, nowadays software cost estimation is a critical issue for the advance software industry. As the modern software’ s behaves dynamically so estimation of the effort and cost is significantly difficult. Since last 30 years, more than 20 models are already developed to estimate the effort and cost for the betterment of software industry. Nevertheless, these algorithms cannot satisfy the modern software industry due to the dynamic behavior of the software for all kind of environments. On this study, an empirical interpolation model is developed to estimate the effort of the software projects. This model compares with the COCOMO based equations and predicts its result analyzing individually taking different cost factors. The equation consists one independent variable (KLOC) and two constants a, b which are chosen empirically taking different NASA projects historical data and the results viewed in this model are compared with COCOMO model with different values of scale factor. In this paper the author analyze more than 250 projects collected from PROMISE repository. The effort variance is very low and the proposed model has the lowest Mean Magnitude of Relative Error (MMRE) and RMSSE.

predicting the effort of a successful project has been a major problem for software engineers the significance of which has led to extensive investigation in this area. One of the main objectives of software engineering society is the development of useful models to predict the costs of software product development. The absence of these activities before starting the project will lead to various problems. Researchers focus their attention on determining techniques with the highest effort prediction accuracy or on suggesting new combinatory techniques for providing better estimates. Despite providing various methods for the estimation of effort in software projects, compatibility and accuracy of the existing methods is not yet satisfactory. In this article, a new method has been presented in order to increase the accuracy of effort estimation. This model is based on the type-2 fuzzy logic in which the gradient descend algorithm and the neurofuzzy- genetic hybrid approach have been used in order to teach the type-2 fuzzy system. In order to evaluate the proposed algorithm, three databases have been used. The results of the proposed model have been compared with neuro-fuzzy and type- 1 fuzzy system. This comparison reveals that the results of the proposed model have been more favorable than those of the other two models.